Finite Equational Bases for Fragments of CCS with Restriction and Relabelling
نویسندگان
چکیده
We investigate the equational theory of several fragments of CCS modulo (strong) bisimilarity with special attention to restriction and relabelling. The largest fragment we consider includes action prefixing, choice, parallel composition without communication, restriction and relabelling. We present a finite equational base (i.e., a finite groundcomplete and omega-complete axiomatisation) for it, including the left merge from ACP as auxiliary operation to facilitate the axiomatisation of parallel composition.
منابع مشابه
A ug 2 00 6 A Finite Equational Base for CCS with Left Merge and Communication Merge ⋆ ⋆ ⋆
Using the left merge and communication merge from ACP, we present an equational base (i.e., a ground-complete and ω-complete set of valid equations) for the fragment of CCS without recursion, restriction and relabelling. Our equational base is finite if the set of actions is finite.
متن کاملSplit-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a finite equational axiomatization over the process algebra obtained by adding an auxiliary operation proposed by Hennessy in 1981 to the recursion, relabelling and restriction free fragment of Milner’s Calculus of Communicating Systems. Thus the addition of a single binary operation, viz. Hennessy’s...
متن کاملOn the Implementation of Concurrent Calculi in Net Calculi: Two Case Studies
Concurrent calculi, such as CCS, are defined in terms of labelled transition system; similarly, here we introduce the notion of net (or distributed) calculus, which is defined through a place/transition Petri net. As a first case study, a simple calculus of nets, called SCONE, is proposed. Relationships between SCONE and the subset of CCS without restriction and relabelling, called RCCS, are st...
متن کاملDecidable Subsets of CCS
Process algebra is a very interesting framework for describing and analyzing concurrent systems. Therefore CCS is used very often and considered pretty important. But it is undecidable if two CCS agents are bisimilar. Luckily Christensen, Hirshfeld and Moller showed 1994 in their paper “Decidable Subsets of CCS” that bisimulation for CCS without communication or without restriction and relabell...
متن کاملCoalgebraic Expressions
We show that certain fixpoint expressions used to describe finite Kripke polynomial coalgebras can be seen as coalgebraic modal fixpoint formulae. Both the synthesis of a coalgebra from its expression and the ability to check behavioural equivalence follow from the same tableau construction. There is an associated complete equational logic, analogous to Kleene algebra, which may now be seen as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008